Disambiguation by Prioritized Circumscription
نویسنده
چکیده
This paper presents a method of resolving ambiguity by using a variant of circumscription, prioritized circumscription. In a disambiguation task, human seems to use various preferences which have various strength. In prioritized circumscription, we can express these preferences as defeasible constraints with various strength and we infer the most preferable logical models which satisfy stronger constraints as much as possible. This representation is very natural for disambiguation since we can regard a logical interpretation as a possible reading and the most preferable logical models as the most preferable readings. We argue that prioritized circumscription is another promising method for the task. We also discuss an implementation of prioritized circumscription by a hierarchical logic programming (HCLP) language.
منابع مشابه
Computing General First-Order Parallel and Prioritized Circumscription
This paper focuses on computing general first-order parallel and prioritized circumscription with varying constants. We propose linear translations from general first-order circumscription to first-order theories under stable model semantics over arbitrary structures, including Trv for parallel circumscription and Tr v for conjunction of parallel circumscriptions (further for prioritized circum...
متن کاملImplementing Prioritized Circumscription by Computing Disjunctive Stable Models
The stable model semantics of disjunctive logic programs is based on minimal models which assign atoms false by default. While this feature is highly useful and leads to concise problem encodings, it occasionally makes knowledge representation with disjunctive rules difficult. Lifschitz’ parallel circumscription provides a remedy by introducing atoms that are allowed to vary or to have fixed va...
متن کاملPrefs 2006 : Preferences and their Applications in Logic Programming Systems
Recently we proposed a method of compiling prioritized circumscription into ASP. However, its encoding has the “guess and check” structure, where the candidates are generated by the “guess” program and the check is expressed by the inconsistency of the “check” program. In this paper, we present another method which compiles prioritized circumscription into a single general disjunctive program (...
متن کاملCompiling Prioritized Circumscription into Extended Logic Programs
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show theoretically that any circumscription whose theory contains both the domain closure axiom and the uniqueness of names axioms can always be compiled into an extended logic program...
متن کاملA Theorem Prover for Prioritized Circumscription
In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized circumscription. The ideas to be described have been implemented, and examples are given of the system in use. 1 Introduction Of all the approaches to nonmonotonic reasoning, Mc-Carthy's circumscription [McCarthy, 1980, M...
متن کامل